On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs
نویسندگان
چکیده
We present O(n’R + n3R3) time algorithms to compute the treewidth, pathwidth, minimum fill-in and minimum interval graph completion of asteroidal triple-free graphs, where n is the number of vertices and R is the number of minimal separators of the input graph. This yields polynomial time algorithms for the four NP-complete graph problems on any subclass of the asteroidal triple-free graphs that has a polynomially bounded number of minimal separators, as e.g. cocomparability graphs of bounded dimension and d-trapezoid graphs for any fixed d > 1.
منابع مشابه
On the Stable Degree of Graphs
We define the stable degree s(G) of a graph G by s(G) = minU maxv∈U dG(v), where the minimum is taken over all maximal independent sets U of G. For this new parameter we prove the following. Deciding whether a graph has stable degree at most k is NP-complete for every fixed k ≥ 3; and the stable degree is hard to approximate. For asteroidal triple-free graphs and graphs of bounded asteroidal nu...
متن کاملDomination and Total Domination on Asteroidal Triple-free Graphs
We present the first polynomial time algorithms for solving the NPcomplete graph problems DOMINATING SET and TOTAL DOMINATING SET when restricted to asteroidal triple-free graphs. We also present algorithms to compute a minimum cardinality dominating set and a minimum cardinality total dominating set on a large superclass of the asteroidal triple-free graphs, called DDP-graphs. These algorithms...
متن کاملConnected Domination and Steiner Set on Asteroidal Triple-Free Graphs
An asteroidal triple is a set of three independent vertices such that between any two of them there exists a path that avoids the neighl.)ourhood of the third. Graphs that do not. co~,tain an asteroidal triple are called asteroidal triple-free (AT-free) graphs. AT-free graphs strictly contain the well-known class of cocomparability graphs, and are not necessarily perfect.. We present efficient,...
متن کاملMinimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For this purpose we define split+ke and split+kv graphs to be the graphs that can be made split by removing at most k edges and at most k vertices, respectively. We show that problems like treewidth and minimum fill-in are ...
متن کاملAlgorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs
K e y w o r d s : graphs, algori thms, HHD-free graphs, t reewidth, min imum fill-in. MSC: 68R10. 1 I n t r o d u c t i o n A graph is HHD-free if it does not contain a house (i.e., the complement of Ps), a hole (Ck for k _> 5) or a domino (see Figure 1). Fig. 1. 'House' (left), 'hole' (middle) and 'domino' (right) * kloks@math, utwente, nl
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 175 شماره
صفحات -
تاریخ انتشار 1997